Ela Nested Graphs with Bounded Second Largest ( Signless Laplacian
نویسندگان
چکیده
Nested split and double nested graphs (commonly named nested graphs) are considered. General statements regarding the signless Laplacian spectra are proven, and the nested graphs whose second largest signless Laplacian eigenvalue is bounded by a fixed integral constant are studied. Some sufficient conditions are provided and a procedure for classifying such graphs in particular cases is provided. Some connections between their structure and some (not only the second) eigenvalues of their signless Laplacians are developed. All double nested graphs whose second largest eigenvalue does not exceed √ 2 are determined.
منابع مشابه
Ela the Signless Laplacian Spectral Radius of Bicyclic Graphs with a given Girth
Let B(n, g) be the class of bicyclic graphs on n vertices with girth g. In this paper, the graphs in B(n, g) with the largest signless Laplacian spectral radius are characterized.
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملThe signless Laplacian separator of graphs
The signless Laplacian separator of a graph is defined as the difference between the largest eigenvalue and the second largest eigenvalue of the associated signless Laplacian matrix. In this paper, we determine the maximum signless Laplacian separators of unicyclic, bicyclic and tricyclic graphs with given order.
متن کاملEla on the Least Signless Laplacian Eigenvalue of Some Graphs
For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.
متن کاملEla on the Main Signless Laplacian Eigenvalues of a Graph
A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, some necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues are given. And the trees and unicyclic graphs with exactly two main signless L...
متن کامل